158 research outputs found
Adaptive neurofuzzy ANFIS modeling of laser surface treatments
This paper introduces a new ANFIS adaptive
neurofuzzy inference model for laser surface heat treatments
based on the Green’s function. Due to its high
versatility, efficiency and low simulation time, this model
is suitable not only for the analysis and design of control
systems, but also for the development of an expert real time
supervision system that would allow detecting and preventing
any failure during the treatment
Multi-Party Coordination in the Context of MOWS
Separation of concerns has been presented as a promising tool to tackle the design of complex systems
in which cross-cutting properties that do not fit into the scope of a class must be satisfied. In this paper,
we show that interactions amongst a number of objects can also be described separately from functionality,
which enhances reusability of functional code and interaction patterns. We present our proposal in the context
of Multi-Qrganisational Web-Based Systems (MOWS) and also present a framework that provides the infrastructure
needed to implement multiparty coordination as an independent aspect
Aspect-oriented interaction in multi-organisational web-based systems
Separation of concerns has been presented as a promising tool to tackle the design of complex systems in which
cross-cutting properties that do not fit into the scope of a class must be satisfied. Unfortunately, current proposals
assume that objects interact by means of object-oriented method calls, which implies that they embed interactions with
others into their functional code. This makes them dependent on this interaction model, and makes it difficult to reuse
them in a context in which another interaction model is more suited, e.g., tuple spaces, multiparty meetings, ports, and
so forth. In this paper, we show that functionality can be described separately from the interaction model used, which
helps enhance reusability of functional code and coordination patterns. Our proposal is innovative in that it is the first
that achieves a clear separation between functionality and interaction in an aspect-oriented manner. In order to show
that it is feasible, we adapted the multiparty interaction model to the context of multiorganisational web-based systems
and developed a class framework to build business objects whose performance rates comparably to handmade implementations;
the development time, however, decreases significantly.ComisiĂłn Interministerial de Ciencia y TecnologĂa TIC2000-1106-C02-0
A Multiparty Coordination Aspect Language
Coordination languages were motivated by an ever-increasing need for producing highly-reusable components, which can be partially achieved by implementing them in a way that is independent of the way they interact. Isolating interaction from computation, persistence and other concerns enhances modularity, thus promoting reusability and understandability. In this paper, we concentrate on a language aimed at describing the simultaneous coordination of a number of entities, which is a problem we are usually faced with when we have to programme bank transfers, purchases with debit cards, auctions, and so on. This language relies on the novel multiparty interaction model
An order-based algorithm for implementing multiparty synchronization
Multiparty interactions are a powerful mechanism for coordinating several entities that need to cooperate
in order to achieve a common goal. In this paper, we present an algorithm for implementing them that
improves on previous results in that it does not require the whole set of entities or interactions to be known
at compile- or run-time, and it can deal with both terminating and non-terminating systems. We also
present a comprehensive simulation analysis that shows how sensitive to changes our algorithm is, and
compare the results with well-known proposals by other authors. This study proves that our algorithm still
performs comparably to other proposals in which the set of entities and interactions is known beforehand,
but outperforms them in some situations that are clearly identified. In addition, these results prove that
our algorithm can be combined with a technique called synchrony loosening without having an effect on
efficiency.Ministerio de Ciencia y TecnologĂa TIC 2003-02737-C02-0
Repairing Syntax Errors in LR Parsers
This article reports on an error-repair algorithm for LR parsers. It locally inserts, deletes or shifts
symbols at the positions where errors are detected, thus modifying the right context in order to
resume parsing on a valid piece of input. This method improves on others in that it does not
require the user to provide additional information about the repair process, it does not require
precalculation of auxiliary tables, and it can be easily integrated into existing LR parser
generators. A Yacc-based implementation is presented along with some experimental results and
comparisons with other well-known methods.ComisiĂłn Interministerial de Ciencia y TecnologĂa TIC 2000–1106–C02–0
An Enablement Detection Algorithm for Open Multiparty Interactions
Coordination axnongst an arbitrary number of entities has
become an important issue in recent years m fields such as e--
commerce, web-based applications and so on. Traditionally,
classical client/server primitives have been used to implement
synchronisation and communication. But. when more
than two entities need to coordinate hy means of those primitives,
the coordination must be decomposed into a number
of client/server hipaxty interactions, leading the programmer
to the need of thinking in terms of the protocols needed
to achieve properties like livenes, atomicity and so on. In
this paper, we present an algorithm to perform enablement
detection to implement open multiparty interactions. This
primitive provides a high level of abstraction since the programmar
can implement multiparty coordination without
the need of thinking in terms of protocols
An Algorithm for Ensuring Fairness and Liveness in Non-deterministic Systems Based on Multiparty Interactions
Strong fairness is a notion we can use to ensure that an element
that is enabled infinitely often in a non–deterministic programme,
will eventually be selected for execution so that it can progress. Unfortunately,
“eventually” is too weak to induce the intuitive idea of liveliness
and leads to anomalies that are not desirable, namely fair finiteness and
conspiracies. In this paper, we focus on non–deterministic programmes
based on multiparty interactions and we present a new criteria for selecting
interactions called strong k–fairness that improves on other proposals
in that it addresses both anomalies simultaneously, and k may be set a
priori to control its goodness. We also show our notion is feasible, and
present an algorithm for scheduling interactions in a strongly k–fair manner
using a theoretical framework to support the multiparty interaction
model. Our algorithm does not require to transform the source code to
the processes that compose the system; furthermore, it can deal with
both terminating and non–terminating processes.ComisiĂłn Interministerial de Ciencia y TecnologĂa TIC 2000–1106–C02–0
An Aspect–Oriented Approach based on Multiparty Interactions to Specifying the Behaviour of a System
Isolating computation and coordination concerns into separate pure computation and pure coordination
enhances modularity, understandability and reusability of parallel and/or distributed software. This can
be achieved by moving interaction primitives, which are now commonly scattered in programs, into separate
modules written in a language aimed at coordinating objects and expressing how information flows
among them. The usual model for coordination is the client/server model, but it is not adequate when
several objects need to collaborate simultaneously in order to solve a problem because natural multiparty
interactions need to be decomposed into a set of low–level, binary interactions.
In this paper, we introduce CAL, an IP–based language for the description of the coordination aspect of
a system. We show that it can be successfully described in terms of simple multiparty interactions that can
be animated and are also amenable to formal reasoning.ComisiĂłn Interministerial de Ciencia y TecnologĂa (CICYT) MENHIR TIC 97–0593–C05–0
a framework for aspect–oriented multiparty coordination
Separation of concerns has been presented as a promising tool to tackle the
design of complex systems in which cross–cutting properties that do no fit into
the scope of a class must be satisfied. In this paper, we show that interaction
amongst a number of objects can also be described separately from functionality
by means of the CAL language, and present a framework that provides the needed
infrastructure. It is innovative because it supports open multiparty interactions
- …